Targeting Cells to Switch Assignment of Cellular Mobile Network using Heuristic Algorithm

In Cellular Mobile Networks, assigning of cells to switch is known as assignment problem. The conventional integer programming method could be used for solving this problem, but then, when the number of cells exceeds 35, the total computational data surpass the memory available, computational time grow too larger and it becomes unfeasible to obtain the optimal solution. Thus this assignment problem defined above is a complex integer programming problem which has been proved to be NP hard problem. Particularly, in this paper addresses single homed assignment problem is discussed where each cells is connected to a single switch only. The objective function is to minimize the link cost between cells and switches upon their assignment. An efficient metaheuristic approach based on Iterative Local search is been proposed to minimizing link cost along with constraint based on number of available port on switches. Empirical results show that the proposed heuristic produces results nearer to optimal solution as expected.